Iterative Learning Control for Over-determined, Under-determined, and Ill–conditioned Systems

نویسندگان

  • Konstantin E. Avrachenkov
  • Richard W. Longman
چکیده

This paper studies iterative learning control (ILC) for under-determined and over-determined systems, i.e., systems for which the control action to produce the desired output is not unique, or for which exact tracking of the desired trajectory is not feasible. For both cases we recommend the use of the pseudoinverse or its approximation as a learning operator. The Tikhonov regularization technique is discussed for computing the pseudoinverse to handle numerical instability. It is shown that for over-determined systems, the minimum error is never reached by a repetition invariant learning controller unless one knows the system exactly. For discrete time uniquely determined systems it is indicated that the inverse is usually ill-conditioned, and hence an approximate inverse based on a pseudoinverse is appropriate, treating the system as overdetermined. Using the structure of the system matrix, an enhanced Tikhonov regularization technique is developed which converges to zero tracking error. It is shown that the Tikhonov regularization is a form of linear quadratic ILC, and that the regularization approach solves the important practical problem of how to intelligently pick the weighting matrices in the quadratic cost. It is also shown how to use a modification of the Tikhonov-based quadratic cost in order to produce a frequency cutoff. This robustifies good learning transients, by reformulating the problem as an over-determined system.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterative learning identification and control for dynamic systems described by NARMAX model

A new iterative learning controller is proposed for a general unknown discrete time-varying nonlinear non-affine system represented by NARMAX (Nonlinear Autoregressive Moving Average with eXogenous inputs) model. The proposed controller is composed of an iterative learning neural identifier and an iterative learning controller. Iterative learning control and iterative learning identification ar...

متن کامل

On the Choice of Subspace for Iterative Methods for Linear Discrete Ill-posed Problems

with a large matrix A of ill-determined rank. Thus, A has many “tiny” singular values of different orders of magnitude. In particular, A is severely ill-conditioned. Some of the singular values of A may be vanishing. We allow m ≥ n or m < n. The right-hand side vector b̃ is not required to be in the range of A. Linear systems of equations of the form (1) with a matrix of ill-determined rank are ...

متن کامل

GMRES Methods for Least Squares Problems

The standard iterative method for solving large sparse least squares problems min ∈Rn ‖ −A ‖2, A ∈ Rm×n is the CGLS method, or its stabilized version LSQR, which applies the (preconditioned) conjugate gradient method to the normal equation ATA = AT . In this paper, we will consider alternative methods using a matrix B ∈ Rn×m and applying the Generalized Minimal Residual (GMRES) method to min ∈R...

متن کامل

Bilateral Teleoperation Systems Using Backtracking Search optimization Algorithm Based Iterative Learning Control

This paper deals with the application of Iterative Learning Control (ILC) to further improve the performance of teleoperation systems based on Smith predictor. The goal is to achieve robust stability and optimal transparency for these systems. The proposed control structure make the slave manipulator follow the master in spite of uncertainties in time delay in communication channel and model pa...

متن کامل

Gmres , L - Curves , and Discrete Ill - Posed Problems ∗

The GMRES method is a popular iterative method for the solution of large linear systems of equations with a nonsymmetric nonsingular matrix. This paper discusses application of the GMRES method to the solution of large linear systems of equations that arise from the discretization of linear ill-posed problems. These linear systems are severely ill-conditioned and are referred to as discrete ill...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003